github.com/andybalholm/brotli.hashComposite.ha (field)

15 uses

	github.com/andybalholm/brotli (current package)
		hash.go#L263: 			ha: newHasher(3),
		hash.go#L296: 			ha: newHasher(54),
		hash.go#L301: 			ha: newHasher(6),
		hash_composite.go#L10: 	var a uint = h.ha.HashTypeLength()
		hash_composite.go#L20: 	var a uint = h.ha.StoreLookahead()
		hash_composite.go#L33: 	ha     hasherHandle
		hash_composite.go#L47: 	if h.ha == nil {
		hash_composite.go#L51: 		common_a = h.ha.Common()
		hash_composite.go#L56: 		h.ha.Initialize(h.params)
		hash_composite.go#L66: 	h.ha.Prepare(one_shot, input_size, data)
		hash_composite.go#L71: 	h.ha.Store(data, mask, ix)
		hash_composite.go#L76: 	h.ha.StoreRange(data, mask, ix_start, ix_end)
		hash_composite.go#L81: 	h.ha.StitchToPreviousBlock(num_bytes, position, ringbuffer, ring_buffer_mask)
		hash_composite.go#L86: 	h.ha.PrepareDistanceCache(distance_cache)
		hash_composite.go#L91: 	h.ha.FindLongestMatch(dictionary, data, ring_buffer_mask, distance_cache, cur_ix, max_length, max_backward, gap, max_distance, out)